// Copyright (c) 2010, Google Inc.
// All rights reserved.
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are
// met:
//
//     * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
//     * Redistributions in binary form must reproduce the above
// copyright notice, this list of conditions and the following disclaimer
// in the documentation and/or other materials provided with the
// distribution.
//     * Neither the name of Google Inc. nor the names of its
// contributors may be used to endorse or promote products derived from
// this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.

// ---
// Author: Jeffrey Junfeng Pan (panjunfeng@gmail.com)

// Frequent Pattern Mining from transactions that stored in file.

#include "miner.h"

const char kExample[] = "testdata/example.txt";

void DemoFrequentPatternMining() {
  // Setup transaction examples.
  frequent_pattern_mining::TransactionsFileImpl<string>
    transactions(kExample, " ");

  // Build the Model of Frequent Pattern Tree
  frequent_pattern_mining::Miner<string>
    miner("THIS_ITEM_NEVER_EXISTS_IN_TRANSACTIONS");
  miner.BuildTreeByMinSupportRatio(&transactions, 0.05);

  // Construct the mined frequent itemsets
  frequent_pattern_mining::Itemsets<string> results;
  miner.GetFrequentItemsetByMinSupportCount(2, &results);

  // Show the input.
  cout << "Input: example transactions" << endl;
  for (int i = 0; transactions.is_valid(i); ++i) {
    cout << i << ":   ";
    for (int j = 0; j < transactions[i].size(); ++j) {
      cout << transactions[i][j] << " ";
    }
    cout << endl;
  }

  // Output the result
  cout << "Output: frequent itemsets" << endl;
  cout << results.ToString();

  // Construct association rules
  frequent_pattern_mining::AssociationRules<string> rules;
  miner.GetAssociationRulesByMinConfidenceRatio(results, 0.50, &rules);
  cout << "Output: association rules "
       << "[support / confidence] (support% / confidence%) "
       << "left-hand-side ==> right-hand-side" << endl;
  cout << rules.ToDebugString();
}

int main(int argc, char **argv) {
  DemoFrequentPatternMining();
  return 0;
}
